Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree

نویسندگان

  • Mike A. Steel
  • Jotun Hein
چکیده

Stochastic models that allow site substitutions, insertions and deletions provide a useful framework for a statistical approach to DNA sequence evolution. Such a model, and recursions to calculate the probability of evolving two sequences, have been known for almost a decade. In this paper we show how the pairwise recursions can be generalised to a 3-sequence tree, and more generally to a r-sequence star-shaped tree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gibbs Sampler for Statistical Multiple Alignment

For a set of sequences, related by a binary tree, that have evolved according to the Thorne-Kishino-Felsenstein model, a Gibbs sampler is presented for simulating the ancestral sequences and their alignments. The updating step consists in updating the ancestral sequence and its three alignments within a 3-star tree. We compare the Gibbs sampler with the algorithm suggested recently by Holmes an...

متن کامل

Using guide trees to construct multiple-sequence evolutionary HMMs

MOTIVATION Score-based progressive alignment algorithms do dynamic programming on successive branches of a guide tree. The analogous probabilistic construct is an Evolutionary HMM. This is a multiple-sequence hidden Markov model (HMM) made by combining transducers (conditionally normalised Pair HMMs) on the branches of a phylogenetic tree. METHODS We present general algorithms for constructin...

متن کامل

Probabilistic pairwise sequence alignment

We describe an new algorithm for visualizing an alignment of biological sequences according to a probabilistic model of evolution. The resulting data array is readily interpreted by the human eye and amenable to digital image techniques. We present examples using mRNA sequences from mouse and rat: three cytochromes and two zinc finger proteins. The underlying evolutionary model is derived from ...

متن کامل

Probabalistic pairwise sequence alignment

We describe an new algorithm for visualizing an alignment of biological sequences according to a probabilistic model of evolution. The resulting data array is readily interpreted by the human eye and amenable to digital image techniques. We present examples using mRNA sequences from mouse and rat: three cytochromes and two zinc finger proteins. The underlying evolutionary model is derived from ...

متن کامل

An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees

We present an efficient algorithm for statistical multiple alignment based on the TKF91 model of Thorne, Kishino, and Felsenstein (1991) on an arbitrary k-leaved phylogenetic tree. The existing algorithms use a hidden Markov model approach, which requires at least O( radical 5(k)) states and leads to a time complexity of O(5(k)L(k)), where L is the geometric mean sequence length. Using a combin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2001